35 ROBUST GEOMETRIC COMPUTATION Chee
نویسندگان
چکیده
Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors. Section 35.1 provides background on these problems. Although nonrobustness is already an issue in “purely numerical” computation, the problem is compounded in “geometric computation.” In Section 35.2 we characterize such computations. Researchers trying to create robust geometric software have tried two approaches: making fixed-precision computation robust (Section 35.3), and making the exact approach viable (Section 35.4). Another source of nonrobustness is the phenomenon of degenerate inputs. General methods for treating degenerate inputs are described in Section 35.5.
منابع مشابه
45 ROBUST GEOMETRIC COMPUTATION Vikram Sharma and Chee
Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors. Section 45.1 provides background on these problems. Although nonrobustness is already an issue in “purely numerical” computation, the problem is compounded in “geometric computation.” In Section 45.2 we characterize such computations. Researchers trying to create robust geometric ...
متن کامل2 the Nature of Geometric Computation
Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising from numerical errors. Section 45.1 provides background on these problems. Although nonrobustness is already an issue in “purely numerical” computation, the problem is compounded in “geometric computation.” In Section 45.2 we characterize such computations. Researchers trying to create robust geometric ...
متن کاملRecent progress in exact geometric computation
Computational geometry has produced an impressive wealth of efficient algorithms. The robust implementation of these algorithms remains a major issue. Among the many proposed approaches for solving numerical non-robustness, Exact Geometric Computation (EGC) has emerged as one of the most successful. This survey describes recent progress in EGC research in three key areas: constructive zero boun...
متن کاملThe Robustness Issue
This article rst recalls with some examples the damages that numerical inaccuracy of oating point arithmetic can cause during geometric computations, in methods from Computational Geometry, Computer Graphics or CADCAM. Then it surveys the various approaches proposed to overcome inaccuracy diiculties. It seems that the only way to achieve robustness for existing methods from Computational Geomet...
متن کاملTowards Exact Geometric Computation
Exact computation is assumed in most algorithms in computational geometry. In practice, implementors perform computation in some fixed-precision model, usually the machine floating-point arithmetic. Such implementations have many well-known problems, here informally called "robustness issues". To reconcile theory and practice, authors have suggested that theoretical algorithms ought to be redes...
متن کامل